VPEcons: A Visual Constructor for Parallel Programming
نویسندگان
چکیده
Parallel Programming Hung-Khoon Tan Wentong Cai Computer Engineering Division School of Applied Science Nanyang Technological University Singapore 2263 Abstract The performance and cost-performance bene ts of parallel systems make them attractive platforms for many applications. But, these are unfortunately o set by the di culties of programming parallel computers. Therefore, programming tools are the key to achieve greater success in developing applications for parallel architectures. This paper describes a new tool, VPEcons, for parallel programming development. It uses graphics to assist in the design of parallel programs. To facilitate the portability of the constructor, a VPEcons Builder has also been developed. It is a tool for creating basic component blocks and binding an existing language to the blocks created. The usefulness of the constructor is demonstrated with a parallel discrete-event simulation example and by comparing it with other visual parallel programming tools.
منابع مشابه
On weakly orthogonal constructor-based graph rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not connuent in general whereas it is connuent in the case of weakly orthogonal term rewriting systems. We show, however , that the considered relation is always connuent, as well as connuent modulo bisimilarity, for a large class of grap...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملComplete Strategies for Admissible-Graph Collapsing Narrowing
Narrowing constitutes the basis of the operational semantics of modern declarative languages which integrate functional and logic programming paradigms. Efficient implementations of these languages consider first-order terms as graphs. In this paper, we investigate narrowing in the setting of graph rewriting systems. We take the full advantage of graph structures by allowing maximal sharing of ...
متن کاملMulti-paradigm Logic Programming Sequential Implementation of Parallel Narrowing
Parallel Narrowing is a narrowing strategy which exploits expression parallelism. We present the rst implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. We deene translation scheme for the general case of multistep narrowing, which is then extended to parallel narrowing by additional elimination rules. Our impleme...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کامل